Compatible associative bialgebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compatible associative products and trees

We compute dimensions and characters of the components of the operad of two compatible associative products, and give an explicit combinatorial construction of the corresponding free algebras in terms of planar rooted trees.

متن کامل

BiHom-Associative Algebras, BiHom-Lie Algebras and BiHom-Bialgebras

A BiHom-associative algebra is a (nonassociative) algebra A endowed with two commuting multiplicative linear maps α, β : A → A such that α(a)(bc) = (ab)β(c), for all a, b, c ∈ A. This concept arose in the study of algebras in so-called group Hom-categories. In this paper, we introduce as well BiHom-Lie algebras (also by using the categorical approach) and BiHom-bialgebras. We discuss these new ...

متن کامل

23PROP and deformation theory of (co)associative bialgebras

We introduce a concept of 2 3 PROP generalizing the Kontsevich concept of 1 2 PROP. We prove that some Stasheff-type compactification of the Kontsevich spaces K(m,n) defines a topological 2 3 PROP structure. The corresponding chain complex is a minimal model for its cohomology (both are considered as 2 3 PROPs). We construct a 2 3 PROP End(V ) for a vector space V . Finally, we construct a dg L...

متن کامل

An explicit deformation theory of (co)associative bialgebras

We find here another (not of the CROC-type) compactification of the Kontsevich spaces K(m,n). This compactification is a Stasheff-type compactification, in particular, it is exactly the Stasheff compactification when n = 1 or m = 1. The boundary strata of this compactification are products of the spaces K(m, n) and of the Stasheff polyhedra. Then we construct a dg Lie algebra naturally associat...

متن کامل

Proving Associative-Communicative Termination Using RPO-Compatible Orderings

Developing path orderings for associative-commutative (AC) rewrite systems has been quite a challenge at least for a decade. Compatibility with the recursive path ordering (RPO) schemes is desirable, and this property helps in orienting the commonly encountered distributiv-ity axiom as desired. For applications in theorem proving and constraint solving, a total ordering on ground terms involvin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Algebra

سال: 2018

ISSN: 0092-7872,1532-4125

DOI: 10.1080/00927872.2018.1424880